Depth of a Random Binary Search Tree with Concurrent Insertions

Shu e a deck of n cards numbered 1 through n. Deal out the rst c cards into a hand. A player then repeatedly chooses one of the cards from the hand, inserts it into a binary search tree, and then adds the next card from deck to the hand (if the deck is empty). When the player nally runs out of cards, how deep can the search tree be? This problem is motivated by concurrent insertions by c processes of random keys into a binary search tree, where the order of insertions is controlled by an adversary that can delay individual processes. We show that an adversary that uses any strategy based on comparing keys cannot obtain an expected average depth greater than O(c + log n). However, the adversary can obtain an expected tree height of Ω(c log(n/c)), using a simple strategy of always playing the largest available card.